Enhancing Usefulness of Declarative Programming Frameworks through Complete Integration
نویسندگان
چکیده
The Gisela framework for declarative programming was developed with the specific aim of providing a tool that would be useful for knowledge representation and reasoning within real-world applications. To achieve this, a complete integration into an object-oriented application development environment was used. The framework and methodology developed provide two alternative application programming interfaces (apis): Programming using objects or programming using a traditional equational declarative style. In addition to providing complete integration, Gisela also allows extensions and modifications due to the general computation model and well-defined apis. We give a brief overview of the declarative model underlying Gisela and we present the methodology proposed for building applications together with some real examples.
منابع مشابه
A verification framework for agent programming with declarative goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a link between agent logics and agent programming frameworks is identified and explained by the fact that agent programming frameworks have hardly incorporated the concept of a declarative goal. Instead, such frameworks ha...
متن کاملComplete Parallelization of Computations: Integration of Data Partitioning and Functional Parallelism for Dynamic Data Structures
Complete Parallelization of Computations: Integration of Data Partitioning and Functional Parallelism for Dynamic Data Structures J.C. Browne, Dwip Banerjee1 Department of Computer Sciences University of Texas Austin, Texas Abstract: This paper presents a parallel programming system which i) supports complete parallelization of array oriented computations through a coherent integration of data ...
متن کاملMathematical programming: Turing completeness and applications to software analysis
Mathematical Programming is Turing complete, and can be used as a general-purpose declarative language. We present a new constructive proof of this fact, and showcase its usefulness by discussing an application to finding the hardest input of any given program running on a Minsky Register Machine. We also discuss an application of Mathematical Programming to software verification obtained by re...
متن کاملPortfolio selection through imprecise Goal Programming model: Integration of the manager`s preferences
In the portfolio selection problem, the manager considers several objectives simultaneously such as the rate of return, the liquidity and the risk of portfolios. These objectives are conflicting and incommensurable. Moreover, the objectives can be imprecise. Generally, the portfolio manager seeks the best combination of the stocks that meets his investment objectives. The imprecise Goal Program...
متن کاملDeclarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey
One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...
متن کامل